Numerical enclosure for each eigenvalue in generalized eigenvalue problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the numerical condition of a generalized Hankel eigenvalue problem

The generalized eigenvalue problem ̃ Hy= λHy with H a Hankel matrix and ̃ H the corresponding shifted Hankel matrix occurs in number of applications such as the reconstruction of the shape of a polygon from its moments, the determination of abscissa of quadrature formulas, of poles of Padé approximants, or of the unknown powers of a sparse black box polynomial in computer algebra. In many of th...

متن کامل

A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems

In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.

متن کامل

Efficient use of the Generalized Eigenvalue Problem

We analyze the systematic errors made when using the generalized eigenvalue problem to extract energies and matrix elements in lattice gauge theory. Effective theories such as HQET are also discussed. Numerical results are shown for the extraction of ground-state and excited B-meson masses and the ground-state decay constant in the static approximation.

متن کامل

Geometric Invariant Theory and Generalized Eigenvalue Problem

Let G be a connected reductive subgroup of a complex connected reductive group Ĝ. Fix maximal tori and Borel subgroups of G and Ĝ. Consider the cone LR(G, Ĝ) generated by the pairs (ν, ν̂) of dominant characters such that Vν is a submodule of Vν̂ (with usual notation). Here we give a minimal set of inequalities describing LR(G, Ĝ) as a part of the dominant chamber. In way, we obtain results about...

متن کامل

Numerical solution of a quadratic eigenvalue problem

We consider the quadratic eigenvalue problem (QEP) (λ2M + λG + K)x = 0, where M = MT is positive definite, K = KT is negative definite, and G = −GT . The eigenvalues of the QEP occur in quadruplets (λ, λ,−λ,−λ) or in real or purely imaginary pairs (λ,−λ). We show that all eigenvalues of the QEP can be found efficiently and with the correct symmetry, by finding a proper solvent X of the matrix e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2012

ISSN: 0377-0427

DOI: 10.1016/j.cam.2011.12.013